Target coverage through distributed clustering in directional sensor networks

Target coverage through distributed clustering in directional sensor networks

Maximum target coverage with minimum number of sensor nodes, known as an MCMS problem, is an important problem in directional sensor networks (DSNs). For guaranteed coverage and event reporting, the underlying mechanism must ensure that all targets are covered by the sensors and the resulting network is connected. Existing solutions allow individual sensor nodes to determine the sensing directi...

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location thr...

Improving Energy-Efficient Target Coverage in Visual Sensor Networks

Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...

improving energy-efficient target coverage in visual sensor networks

target coverage is one of the important problems in visual sensor networks. the coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. in this paper, we address the maximum lifetime for visual sensor networks (mlv) problem by maximizing the network lifetime while covering all the targets. for this purpose, we develop a simulated annealing (sa) ...

Coverage Quality in Visual Sensor Networks